Odd Hole Recognition in Graphs of Bounded Clique Size
نویسندگان
چکیده
In a graph G, an odd hole is an induced odd cycle of length at least five. A clique of G is a set of pairwise adjacent vertices. In this paper we consider the class Ck of graphs whose cliques have a size bounded by a constant k. Given a graph G in Ck, we show how to recognize in polynomial time whether G contains an odd hole.
منابع مشابه
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
Gyárfás conjectured in 1985 that for all k, l, every graph with no clique of size more than k and no odd hole of length more than l has chromatic number bounded by a function of k, l. We prove three weaker statements: • Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; • For all l, every triangle-free graph with sufficiently large ...
متن کاملDecomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs
A diamond is a graph on 4 vertices with exactly one pair of non-adjacent vertices, and an odd hole is an induced cycle of odd length. If G,H are graphs, G is H-free if no induced subgraph of G is isomorphic to H. A clique-colouring of G is an assignment of colours to the vertices of G such that no inclusion-wise maximal clique of size at least 2 is monochromatic. We show that every (diamond, od...
متن کاملStructure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملThree steps towards Gyárfás’ conjecture
Gyárfás conjectured in 1985 that for all k, l, every graph with no clique of size more than k and no odd hole of length more than l has chromatic number bounded by a function of k, l. We prove three weaker statements: • Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; • For all l, every triangle-free graph with sufficiently large ...
متن کاملInduced subgraphs of graphs with large chromatic number. VII. Gyárfás’ complementation conjecture
A class of graphs is χ-bounded if there is a function f such that χ(G) ≤ f(ω(G)) for every induced subgraph G of every graph in the class, where χ, ω denote the chromatic number and clique number of G respectively. In 1987, Gyárfás conjectured that for every c, if C is a class of graphs such that χ(G) ≤ ω(G) + c for every induced subgraph G of every graph in the class, then the class of complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006